Nash Equilibrium Computation in Subnetwork Zero-Sum Games With Switching Communications
نویسندگان
چکیده
منابع مشابه
Nash Equilibrium Seeking in Subnetwork Zero-Sum Games with Switching Communication Graphs
In this paper, we investigate a distributed Nash equilibrium seeking problem for a timevarying multi-agent network consisting of two subnetworks. We propose a subgradientbased distributed algorithm to seek a Nash equilibrium of a zero-sum game, where the two subnetworks share the same sum objective function. We show that the proposed distributed algorithm with homogenous stepsize can achieve a ...
متن کاملNash Equilibrium Computation in Various Games
Non-cooperative Game Theory provides a framework to analyze the strategic interactions of selfish agents in any given organization. In a pioneering work, John Nash (1951) [49] proved that in any such (finite) organization, there exists a steady state where no agent benefits by unilateral deviation, henceforth called Nash equilibrium (NE). Nash equilibrium is perhaps the most well known and well...
متن کاملDouble-oracle algorithm for computing an exact nash equilibrium in zero-sum extensive-form games
We investigate an iterative algorithm for computing an exact Nash equilibrium in two-player zero-sum extensive-form games with imperfect information. The approach uses the sequence-form representation of extensive-form games and the double-oracle algorithmic framework. The main idea is to restrict the game by allowing the players to play only some of the sequences of available actions, then ite...
متن کاملEquilibrium Computation and Robust Optimization in Zero Sum Games with Submodular Structure
We define a class of zero-sum games with combinatorial structure, where the best response problem of one player is to maximize a submodular function. For example, this class includes security games played on networks, as well as the problem of robustly optimizing a submodular function over the worst case from a set of scenarios. The challenge in computing equilibria is that both players’ strate...
متن کاملA TRANSITION FROM TWO-PERSON ZERO-SUM GAMES TO COOPERATIVE GAMES WITH FUZZY PAYOFFS
In this paper, we deal with games with fuzzy payoffs. We proved that players who are playing a zero-sum game with fuzzy payoffs against Nature are able to increase their joint payoff, and hence their individual payoffs by cooperating. It is shown that, a cooperative game with the fuzzy characteristic function can be constructed via the optimal game values of the zero-sum games with fuzzy payoff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2016
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2015.2504962